Polynomial division and its computational complexity
نویسندگان
چکیده
منابع مشابه
Polynomial division and its computational complexity
(i) First we show that all the known algorithms for polynomial division can be represented as algorithms for triangular Toeplitz matrix inversion. In spite of the apparent difference of the algorithms of these two classes, their strong equivalence is demonstrated. (ii) Then we accelerate parallel division of two polynomials with integer coefficients of degrees at most m by a factor of log m com...
متن کاملComputational Complexity in Polynomial Algebra
In recent years a number of algorithms have been designed for the "inverse" computational problems of polynomial algebra—factoring polynomials, solving systems of polynomial equations, or systems of polynomial inequalities, and related problems—with running time considerably less than that of the algorithms which were previously known. (For the computational complexity of the "direct" problems ...
متن کاملImproved Parallel Polynomial Division and Its Extensions
We compute the rst N coeecients of the reciprocal r(x) of a given polynomial p(x), (r(x)p(x) = 1 mod x N , p(0) 6 = 0), by using, under the PRAM arithmetic models , O(h log N) time-steps and O((N=h)(1 + 2 ?h log (h) N)) processors, for any h, h = 1; 2; : : : ; log N, provided that O(log m) steps and m processors suuce to perform DFT on m points and that log (0)
متن کاملComputational Polynomial Algebra and Its Biological Applications
This is an informal note that provides basic information about methods and software tools of resultants, triangular sets, Gröbner bases, real solving, quantifier elimination, and symbolic-numeric computation developed in computational polynomial algebra. Some recent applications of the methods and tools to the study of biological networks are discussed briefly.
متن کاملEffective Prediction and its Computational Complexity
A model for the problem of predicting the outputs of a process, based only on knowledge of previous outputs, is proposed in terms of a decision problem. The strength of this particular formulation of the decision problem follows from the accuracy of its outputs in predicting the outputs of any particular deterministic process, and this predictability is quantified in terms of the number of bits...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1986
ISSN: 0885-064X
DOI: 10.1016/0885-064x(86)90001-4